Discussing about “Inclusion in Sharing-Based Services”. A design workshop using an analytic tool
نویسندگان
چکیده
منابع مشابه
Using phenotypic sharing in a classifier tool
This paper describes a classifier tool that uses a genetic algorithm to make rule induction. The genetic algorithm uses the Michigan approach, is domain independent and is able to process continuous and discrete attributes. Some optimizations include the use of phenotypic sharing (with linear complexity) to direct the search. The results of accuracy are compared with other 33 algorithms in 32 d...
متن کاملDiviz: an Mcda Workflow Design, Execution and Sharing Tool
The diviz software is a tool for designing, executing and sharing Multiple Criteria Decision Aid (MCDA) techniques. The target user community of diviz reaches from researchers who require to construct algorithmic workflows of elementary MCDA components to teachers who need to present MCDA methods and let their students experiment them. Besides, one of the principal features of diviz is to ease ...
متن کاملNormality of Composite Analytic Functions and Sharing an Analytic Function
A result of Hinchliffe 2003 is extended to transcendental entire function, and an alternative proof is given in this paper. Our main result is as follows: let α z be an analytic function, F a family of analytic functions in a domain D, and H z a transcendental entire function. If H ◦ f z and H ◦ g z share α z IM for each pair f z , g z ∈ F, and one of the following conditions holds: 1 H z −α z0...
متن کاملDiscussing HPF Design Issues
As High Performance Fortran (HPF) is being both developed and redesigned by the HPF Forum, it is important to provide comprehensive criteria for analyzing HPF features. This paper presents such criteria related to three aspects: adequacy to applications, aesthetic and soundness in a language, and implementability. Some features already in HPF or being currently discussed are analyzed according ...
متن کاملReasoning About Embedded Dependencies Using Inclusion Dependencies
The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Design Journal
سال: 2017
ISSN: 1460-6925,1756-3062
DOI: 10.1080/14606925.2017.1352964